Interpretation of Complex Scenes Using Dynamic Tree-Structure Belief Networks

نویسندگان

  • Sinisa Todorovic
  • Michael C. Nechyba
چکیده

In this paper, we address the problem of object detection and recognition in complex scenes, where objects are partially occluded. We speculate that a careful analysis of visible object details at various scales may prove critical for recognition in these settings. However, in general, computational complexity becomes prohibitive when trying to analyze multiple sub-parts of multiple objects in an image. To alleviate this problem, we propose a generative-model framework – namely, Dynamic Tree-Structure Belief Networks (DTSBNs) and a novel Structured Variational Approximation (SVA) inference algorithm for DTSBNs. Thus, we formulate object detection and recognition as inference of DTSBN structure and image-class conditional distributions, given an image. The causal (Markovian) dependencies in DTSBNs allow us to design computationally efficient inference, as well as to interpret the estimated structure as follows: each root represents a whole distinct object, while children nodes down the sub-tree represent parts of that object at various scales. Therefore, within the DTSBN framework, the treatment and recognition of object parts requires no additional training, but merely a particular interpretation of the tree/subtree structure. This property allows us to devise a strategy for recognition of objects as a whole through recognition of their visible parts. Our experimental results demonstrate that this approach remarkably outperforms strategies without explicit analysis of object parts.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interpretation of complex scenes using dynamic tree-structure Bayesian networks

This paper addresses the problem of object detection and recognition in complex scenes, where objects are partially occluded. The approach presented herein is based on the hypothesis that a careful analysis of visible object details at various scales is critical for recognition in such settings. In general, however, computational complexity becomes prohibitive when trying to analyze multiple su...

متن کامل

Dynamic Trees: Learning to Model Outdoor Scenes

This paper considers the dynamic tree (DT) model, first introduced in [1]. A dynamic tree specifies a prior over structures of trees, each of which is a forest of one or more tree-structured belief networks (TSBN). In the literature standard tree-structured belief network models have been found to produce “blocky” segmentations when naturally occurring boundaries within an image did not coincid...

متن کامل

Constructing Flexible Dynamic Belief Networks from First-Order Probalistic Knowledge Bases

This paper investigates the power of first-order probabilistic logic (FOPL) as a representation language for complex dynamic situations. We introduce a sublanguage of FOPL and use it to provide a first-order version of dynamic belief networks. We show that this language is expressive enough to enable reasoning over time and to allow procedural representations of conditional probability tables. ...

متن کامل

Constructing Flexible Dynamic Belief Networks from First-Order Probabilistic Knowledge Bases

This paper investigates the power of first-order probabilistic logic (FOPL) as a representation language for complex dynamic situations. We introduce a sublanguage of FOPL and use it to provide a first-order version of dynamic belief networks.We show that this language is expressive enough to enable reasoning over time and to allow procedural representations of conditional probability tables. I...

متن کامل

Synchronization for Complex Dynamic Networks with State and Coupling Time-Delays

This paper is concerned with the problem of synchronization for complex dynamic networks with state and coupling time-delays. Therefore, larger class and more complicated complex dynamic networks can be considered for the synchronization problem. Based on the Lyapunov-Krasovskii functional, a delay-independent criterion is obtained and formulated in the form of linear matrix inequalities (LMIs)...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005